منابع مشابه
Systems Change and Local Alliances to Address Community Challenges.
for the largest increase in percentage of eligible people enrolled in the insurance exchange of the Affordable Care Act of any large city in America.4 Competition has a place, but collaboration can get a lot more done. Another alliance that might improve longterm health is outlined in the article from Traun and colleagues,5 where they interviewed pediatricians about attitudes and approaches to ...
متن کاملStrong Alliances in Graphs
For any simple connected graph $G=(V,E)$, a defensive alliance is a subset $S$ of $V$ satisfying the condition that every vertex $vin S$ has at most one more neighbour in $V-S$ than it has in $S$. The minimum cardinality of any defensive alliance in $G$ is called the alliance number of $G$, denoted $a(G)$. In this paper, we introduce a new type of alliance number called $k$-strong alliance numb...
متن کاملAre current syndicated loan alliances related to past alliances?
The odds of a current syndicate relationship between two lenders depend upon their previous alliances. The odds are significantly higher [lower] and strongest for a current lead–participant relationship with a continuation [reversal] of their previous roles. To illustrate, the odds are nearly four times higher when two lenders have allied in the previous 5 years. The strength of lead–participan...
متن کاملOn defensive alliances and strong global offensive alliances
We consider complexity issues and upper bounds for defensive alliances and strong global offensive alliances in graphs. We prove that it is NP-complete to decide for a given 6-regular graph G and a given integer a, whether G contains a defensive alliance of order at most a. Furthermore, we prove that determining the strong global offensive alliance number γô(G) of a graph G is APX-hard for cubi...
متن کاملWeighted Alliances in Graphs
Let G = (V, E) be a graph and let W:V→N be a non-negative integer weighting of the vertices in V. A nonempty set of vertices S ⊆ V is called a weighted defensive alliance if ∀v ∈ S ,∑u∈N[v]∩S w(u) ≥ ∑x∈N(v)−S w(x). A non-empty set S ⊆ V is a weighted offensive alliance if ∀v ∈ δS ,∑u∈N(v)∩S w(u) ≥ ∑x∈N[v]−S w(x). A weighted alliance which is both defensive and offensive is called a weighted pow...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Sociology
سال: 1895
ISSN: 0002-9602,1537-5390
DOI: 10.1086/210514